Some Plane Curvature Approximations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for stochastic approximations of curvature flows

Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame propagation, and computer vision. In some previous work [1], we have described a random particle system, evolving on the discretized unit circle, whose profile converges toward the Gauss-Minkowsky transformation of so...

متن کامل

Some Undecidable Approximations of TRSs

In this paper we study the decidability of reachability, normalisation, and neededness in n-shallow and n-growing TRSs. In an n-growing TRS, a variable that occurs both on the leftand right-hand side of a rewrite rule must be at depth n on the left-hand side and at depth greater than n on the right-hand side. In an n-shallow TRS, a variable that occurs both on the leftand right-hand side of a r...

متن کامل

Some Remarks on Padé-approximations

Padé approximations are widely used to approximate a dead-time in continuous control systems. It provides a finite-dimensional rational approximation of a dead-time. However, the standard Padé approximation (recommended in many textbooks) with equal numeratorand denominator degree, exhibits a jump at time t=0. This is highly undesirable in simulating dead-times. To avoid this phenomena we shall...

متن کامل

Some Remarks on Diophantine Approximations

BY P. ERDOS, University of Syracuse . [Received 27 July, 1948 .] 1 . The present note contains some disconnected remarks on diophatine approximations . First we collect a few well-known results about continued fractions, which we shall use later' . Let a be an irrational number, q, < q2 < . . . be the sequence of the denominators of its convergents . For almost all a we have fork > k,,(a), qk+,...

متن کامل

Discrete Curvature Approximations and Segmentation of Polyhedral Surfaces

The segmentation of digitized data to divide a free form surface into patches is one of the key steps required to perform a reverse engineering process of an object. To this end, discrete curvature approximations are introduced as the basis of a segmentation process that lead to a decomposition of digitized data into areas that will help the construction of parametric surface patches. The appro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1987

ISSN: 0025-5718

DOI: 10.2307/2008259